A Space Optimization Using Inexact Instruction Matches
نویسنده
چکیده
In this paper we examine parameterized procedural abstraction. This is an extension of an optimization whose sole purpose is to reduce code size. Previously published implementations of procedural abstraction have produced space savings if the instruction sequences are exact matches. We show that permanent space savings (compaction) are possible when (1) covering all inexact matches by several procedures and (2) carefully choosing the inexact match instances covered by each procedure. Our algorithms yield substantially better space savings in comparison to approaches constrained to use unparameterized procedures.
منابع مشابه
Inexact-hessian-vector Products for Efficient Reduced-space Pde-constrained Optimization
We investigate reduced-space Newton-Krylov (NK) algorithms for engineering parameter optimization problems constrained by partial-differential equations. We review reduced-space and full-space optimization algorithms, and we show that the efficiency of the reduced-space strategy can be improved significantly with inexact-Hessianvector products computed using approximate second-order adjoints. R...
متن کاملAn Inexact-Fuzzy-Stochastic Optimization Model for a Closed Loop Supply Chain Network Design Problem
The development of optimization and mathematical models for closed loop supply chain (CLSC) design has attracted considerable interest over the past decades. However, the uncertainties that are inherent in the network design and the complex interactions among various uncertain parameters are challenging the capabilities of the developed tools. The aim of this paper, therefore, is to propose a n...
متن کاملNonlinear Preconditioning Techniques for Full-Space Lagrange-Newton Solution of PDE-Constrained Optimization Problems
The full-space Lagrange–Newton algorithm is one of the numerical algorithms for solving problems arising from optimization problems constrained by nonlinear partial differential equations. Newton-type methods enjoy fast convergence when the nonlinearity in the system is well-balanced; however, for some problems, such as the control of incompressible flows, even linear convergence is difficult t...
متن کاملInexact Restoration for Euler Discretization of Box-Constrained Optimal Control Problems
The Inexact Restoration method for Euler discretization of state and control constrained optimal control problems is studied. Convergence of the discretized (finitedimensional optimization) problem to an approximate solution using the Inexact Restoration method and convergence of the approximate solution to a continuous-time solution of the original problem are established. It is proved that a ...
متن کاملModelling of Inexact 2 - D Shapes using Real - coded GeneticAlgorithmsRam
Inexact Shapes-where a single model is capable of representing a class of shapes-provide an abstraction that is useful in conceptual design, object recognition, morphing, etc. In this work we present an axis-based model for ambiguous shape modeling. This is done by perturbing the links in an axial model of a contour in arbitrary ways. We demonstrate an optimization application in this paper whe...
متن کامل